/**
 * Given a binary tree, find its minimum depth.
 * The minimum depth is the number of nodes along the shortest path from the root node down to the 
 * nearest leaf node.
 */
/**
 * @author Ivan
 *
 */
package problem111_Minimum_Depth_of_Binary_Tree;